Consistency in one-sided assignment problems

Consistency and Monotonicity in One-Sided Assignment Problems

One-sided assignment problems combine important features of two well-known matching models. First, as in roommate problems, any two agents can be matched and second, as in two-sided assignment problems, the payoffs of a matching can be divided between the agents. We take a similar approach to one-sided assignment problems as Sasaki (1995) for two-sided assignment problems and we analyze various...

One-Sided Interval Trees

We give an alternative treatment and extension of some results of Itoh and Mahmoud on one-sided interval trees. The proofs are based on renewal theory, including a case with mixed multiplicative and additive renewals.

Incentives in One-Sided Matching Problems With Ordinal Preferences

One of the core problems in multiagent systems is how to efficiently allocate a set of indivisible resources to a group of self-interested agents that compete over scarce and limited alternatives. In these settings, mechanism design approaches such as matching mechanisms and auctions are often applied to guarantee fairness and efficiency while preventing agents from manipulating the outcomes. I...

One - sided Versus Two - sided Error in

One-sided Logic in Two-sided Markets

In this paper, I consider eight basic fallacies that can arise from using conventional wisdom from one-sided markets in two-sided market settings. These fallacies are illustrated using statements made in the context of regulatory investigations into credit card schemes in Australia and the United Kingdom. I discuss how these fallacies may be reconciled by proper use of a two-sided market analys...